Robust polygon modelling

نویسنده

  • Victor J. Milenkovic
چکیده

The paper provides a set of algorithms for performing set operations on polygonal regions in the plane using standard floating-point arithmetc. The algorithms are robust, guaranteeing both topological consistency and numerical accuracy. Each polygon edge is modelled as an implicit or explicit polygonal curve which stays within some distance fl of the original line segment. If the curve is implicit, fl is bounded by a small multiple of the rounding unit. If the curves are explicit, the bound on fl may grow with the number of curves. One can mix implicit and explicit representations to suit the application.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An algorithm for determining intersection segment-polygon in 3D

ÐIn the ®elds related to geometric modelling, it is fundamental to count on robust. In this work we present a new algorithm for testing the intersection between a segment and a polygon in 3D space. This algorithm is robust and ecient, and it is the basis of most operations developed in geometric modelling. After, we will apply this algorithm to a classic problem in computer graphics: determini...

متن کامل

A Robust Feedforward Active Noise Control System with a Variable Step-Size FxLMS Algorithm: Designing a New Online Secondary Path Modelling Method

Several approaches have been introduced in literature for active noise control (ANC)systems. Since Filtered-x-Least Mean Square (FxLMS) algorithm appears to be the best choice as acontroller filter. Researchers tend to improve performance of ANC systems by enhancing andmodifying this algorithm. This paper proposes a new version of FxLMS algorithm. In many ANCapplications an online secondary pat...

متن کامل

Application of Stochastic Optimal Control, Game Theory and Information Fusion for Cyber Defense Modelling

The present paper addresses an effective cyber defense model by applying information fusion based game theoretical approaches‎. ‎In the present paper, we are trying to improve previous models by applying stochastic optimal control and robust optimization techniques‎. ‎Jump processes are applied to model different and complex situations in cyber games‎. ‎Applying jump processes we propose some m...

متن کامل

Robust Tensegrity Polygons

A tensegrity polygon is a planar cable-strut tensegrity framework in which the cables form a convex polygon containing all vertices. The underlying edgelabeled graph, in which the cable edges form a Hamilton cycle, is an abstract tensegrity polygon. It is said to be robust if every convex realization as a tensegrity polygon has an equilibrium stress which is positive on the cables and negative ...

متن کامل

Modelling and Compensation of uncertain time-delays in networked control systems with plant uncertainty using an Improved RMPC Method

Control systems with digital communication between sensors, controllers and actuators are called as Networked Control Systems (NCSs). In general, NCSs encounter with some problems such as packet dropouts and network induced delays. When plant uncertainty is added to the aforementioned problems, the design of the robust controller that is able to guarantee the stability, becomes more complex. In...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computer-Aided Design

دوره 25  شماره 

صفحات  -

تاریخ انتشار 1993